A DNA Sticker Algorithm for Solving N-Queen Problem
نویسندگان
چکیده
Over the past few decades numerous attempts have been made to solve combinatorial optimization problems that are NP-complete or NP -hard. It has been evidenced that DNA computing can solve those problems which are currently intractable on even fastest electronic computers. This paper proposes a new DNA algorithm for solving N-Queen problem, a complex optimization problem. The algorithm not only shows whether or not a solution exists, but provides all possible solutions by massively parallel computations. The proposed algorithm can be easily extended to solve other optimization problems.
منابع مشابه
Solving N Queen Problem Using Various Algorithms – A Survey
Combinatorial optimization problems form a set of problems which need a considerable effort and time to be solved. Their difficulty lies in the fact that there is no formula for solving them exactly. Every possibility has to be examined in order to find the best solution and the number of possibilities increases exponentially as the size of the problem increases. In this paper we discussed abou...
متن کاملA Parallel Algorithm for Solving Sat Problem Based on Dna Computing
In this paper, stickers are used to construct a solution space of DNA for the satisfiability (SAT) problem. Simultaneously DNA operations are applied in the sticker-based model to develop a DNA algorithm. The result of the proposed algorithm shows that the SAT problem is resolved with biological operation in the sticker-based model for solution space of sticker. Furthermore, this work presents ...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملSolving the 0/1 Knapsack Problem by a Biomolecular DNA Computer
Solving some mathematical problems such as NP-complete problems by conventional silicon-based computers is problematic and takes so long time. DNA computing is an alternative method of computing which uses DNA molecules for computing purposes. DNA computers have massive degrees of parallel processing capability. The massive parallel processing characteristic of DNA computers is of particular in...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJCSA
دوره 5 شماره
صفحات -
تاریخ انتشار 2008